Evolving voter model on dense random graphs
نویسندگان
چکیده
منابع مشابه
The Evolving Voter Model on Thick Graphs
In the evolving voter model, when an individual interacts with a neighbor having an opinion different from theirs, they will with probability 1− α imitate the neighbor but with probability α will sever the connection and choose a new neighbor at random (i) from the graph or (ii) from those with the same opinion. Durrett et al. [7] used simulation and heuristics to study these dynamics on sparse...
متن کاملLatent Voter Model on Locally Tree-Like Random Graphs
In the latent voter model, which models the spread of a technology through a social network, individuals who have just changed their choice have a latent period, which is exponential with rate λ, during which they will not buy a new device. We study site and edge versions of this model on random graphs generated by a configuration model in which the degrees d(x) have 3 ≤ d(x) ≤M . We show that ...
متن کاملVoter model on heterogeneous graphs.
We study the voter model on heterogeneous graphs. We exploit the nonconservation of the magnetization to characterize how consensus is reached. For a network of N nodes with an arbitrary but uncorrelated degree distribution, the mean time to reach consensus T(N) scales as Nmu(2)1/mu(2), where mu(k) is the kth moment of the degree distribution. For a power-law degree distribution n(k) approximat...
متن کاملGraph fission in an evolving voter model.
We consider a simplified model of a social network in which individuals have one of two opinions (called 0 and 1) and their opinions and the network connections coevolve. Edges are picked at random. If the two connected individuals hold different opinions then, with probability 1 - α, one imitates the opinion of the other; otherwise (i.e., with probability α), the link between them is broken an...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: The Annals of Applied Probability
سال: 2017
ISSN: 1050-5164
DOI: 10.1214/16-aap1230